algorithm complexity

[ˈælɡəriðəm kəmˈpleksɪti:]
  • 释义

    算法复杂性;

数据更新时间:2026-04-18 08:27:44
1、

The algorithm complexity is.

算法的复杂度为.

互联网摘选

2、

If we are to raise compression speed, then the algorithm complexity must increase.

如果要提高压缩速度, 那么算法的复杂度就得增加了.

互联网摘选

3、

The hardware cost of this network is O ( NlogN). and the time complexity of this multicast algorithm is O ( N).

此类的网络的硬件代价为O(NlogN),此多源点多播路由算法的时间复杂度为O(N)

互联网摘选

4、

A new automatic white balance algorithm was proposed for scene adaptivity or algorithm complexity of basic automatic white balance algorithms.

针对常见的自动白平衡算法存在的图像场景适应性不足或算法复杂度过高的问题,提出了一种新的自动白平衡算法。

互联网摘选

5、

The algorithm can decompose a complex planar polygon with nesting holes, and its time complexity is O ( nlogn) by analysis and testing.

该算法能够分解内嵌多个环的复杂多边形,分析及测试表明,其时间复杂度为O(nlogn)。

互联网摘选

6、

Finally, the algorithm complexity has also been analyzed in detail.

分析了算法的存储与计算复杂度。

互联网摘选

7、

The problems such as the algorithm complexity and the sampling period are also discussed.

并讨论了这些算法的时间复杂度,采样周期等问题。

互联网摘选

8、

May be your problem falls into a infinite loop or you should reduce your algorithm complexity.

可能是您的程序陷入了死循环或者您需要改进您的算法复杂度.

互联网摘选

9、

Through the simulation experiment and the time analysis of algorithm complexity, the trade-off between the real-time ability and the effectiveness of removing noise in LLL images is attained.

经过仿真实验及算法复杂度的时间分析,在实时性和微光图像消噪效果之间取得了平衡。

互联网摘选

10、

The binary searching algorithm based on comparison have the complexity of O ( NlogN).

处理汉字的以比较为基础的二分查找算法,其复杂性为O(NlogN)。

互联网摘选

11、

By analysis, The time s complexity of this algorithm is O ( nlogn). Finally, inserting constrained edge is used to Expresses Delaunay Triangulation in the constrained data field.

经分析,整个算法的时间复杂度为O(nlogn)。最后对空间约束条件的处理采用了嵌入约束边的方法。

互联网摘选

12、

Comparing with artificial participation, algorithm complexity can obviously accelerate the processing speed.

相对于人工参与量,算法复杂度的降低能显著加速处理进程。

互联网摘选

13、

It is proved that the time complexity of the algorithm is 0 ( AT) in general and O ( NlogN) at worst cases.

推导证明了综合算法在一般情况下的时间复杂度为O(N),最坏情况下的时间复杂度为O(NlogN)。

互联网摘选

14、

Algorithm complexity of two& way polyphase merge external sort

二路多步归并外分类的算法复杂度

互联网摘选

  • 相关词组
  • 今日热词
  • 热门搜索

微语录(www.volg.cn)为您提供在线词典、英语翻译、单词大全、英译汉、汉译英等英语服务!可通过lj:关键词格式搜索句子,如lj:affect,搜索affect相关的双语例句!

用户反馈
请选择反馈类型(可多选):
您的联系方式:(如需回复请填写联系方式)
反馈内容:
提交成功 小编会尽快处理
回到顶部
点击反馈